Faster Optimal and Suboptimal Hierarchical Search
نویسندگان
چکیده
Nodes Expanded (100K) CPU Time (s) Algorithm Weight Solved Sub-optimality Mean Median Mean Median Switch 100 1.13 0.29 0.20 0.10 0.06 Short Circuit 100 1 1.39 0.91 0.89 0.55 Short Circuit WA* 1.1 100 1.01 1.69 1.28 1.10 0.81 ” ” 1.2 100 1.03 2.39 1.89 1.59 1.24 ” ” 2 100 1.24 6.34 6.77 4.46 5.00 ” ” 5 100 1.44 6.03 8.06 4.22 5.75 ” ” 10 100 1.53 5.51 6.34 3.84 4.52 Short Circuit Greedy 100 5.17 8.25 8.69 5.63 6.00
منابع مشابه
Faster Optimal and Suboptimal Hierarchical Search By
FASTER OPTIMAL AND SUBOPTIMAL HIERARCHICAL SEARCH by Michael Leighton University of New Hampshire, May, 2012 In problem domains for which an informed admissible heuristic function is not available, one attractive approach is hierarchical search. Hierarchical search uses search in an abstracted version of the problem to dynamically generate heuristic values. This thesis makes three contributions...
متن کاملSIMULATED ANNEALING ALGORITHM FOR SELECTING SUBOPTIMAL CYCLE BASIS OF A GRAPH
The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...
متن کاملBounded Suboptimal Search in Linear Space: New Results
Bounded suboptimal search algorithms are usually faster than optimal ones, but they can still run out of memory on large problems. This paper makes three contributions. First, we show how solution length estimates, used by the current stateof-the-art linear-space bounded suboptimal search algorithm Iterative Deepening EES, can be used to improve unboundedspace suboptimal search. Second, we conv...
متن کاملAlternative Forms of Bounded Suboptimal Search
Finding optimal solutions to search problems is often not practical due to run-time constraints. This has led to the development of algorithms that sacrifice solution quality in favour of a faster search. The solution quality of a suboptimal solution is often measured by the ratio C C , where C is the cost of the solution found and C is the cost of the optimal solution. Some search algorithms a...
متن کاملFaster Bounded-Cost Search Using Inadmissible Estimates
Many important problems are too difficult to solve optimally. A traditional approach to such problems is bounded suboptimal search, which guarantees solution costs within a userspecified factor of optimal. Recently, a complementary approach has been proposed: bounded-cost search, where solution cost is required to be below a user-specified absolute bound. In this paper, we show how bounded-cost...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011